Developing And Comparing Numerical Methods For Computing The Inverse Fourier Transform
نویسندگان
چکیده
Computing the Fourier transform and its inverse is important in many applications of mathematics, such as frequency analysis, signal modulation, and filtering. Two methods will be derived for numerically computing the inverse Fourier transforms, and they will be compared to the standard inverse discrete Fourier transform (IDFT) method. The first computes the inverse Fourier transform through direct use of the Laguerre expansion of a function. The second employs the Riesz projections, also known as Hilbert projections, to numerically compute the inverse Fourier transform. For some smooth functions with slow decay in the frequency domain, the Laguerre and Hilbert methods will work better than the standard IDFT. Applications of the Hilbert transform method are related to the numerical solutions of nonlinear inverse scattering problems and may have implications for the associated reconstruction algorithms.
منابع مشابه
Rapid Computation of the Discrete Fourier Transform
Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system ...
متن کاملProjective Fourier Analysis in Computer Vision: Theory and Computer Simulations
Identifying the projective group for patterns by developing the camera model, the projective Fourier transform and its inverse are obtained in analogy with the classical, that is, Euclidean Fourier analysis. Projectively adapted properties are demonstrated in a numerical test. Using the expression of the projective Fourier integral by a standard Fourier integral in the coordinates given by the ...
متن کاملSpectrally formulated finite element for vibration analysis of an Euler-Bernoulli beam on Pasternak foundation
In this article, vibration analysis of an Euler-Bernoulli beam resting on a Pasternak-type foundation is studied. The governing equation is solved by using a spectral finite element model (SFEM). The solution involves calculating wave and time responses of the beam. The Fast Fourier Transform function is used for temporal discretization of the governing partial differential equation into a se...
متن کاملInverse Source Problems for the Helmholtz Equation and the Windowed Fourier Transform
In this work we extend the qualitative reconstruction method for inverse source problems for time-harmonic acoustic and electromagnetic waves in free space, recently developed in [R. Griesmaier, M. Hanke, and T. Raasch, SIAM J. Sci. Comput., 34 (2012), pp. A1544–A1562], to a relevant three-dimensional setting. The reconstruction algorithm relies on the fact that a windowed Fourier transform of ...
متن کاملSignal Reconstruction from given Phase of the Fourier Transform Using Fejér Monotone Methods
The aim is to reconstruct a signal function x ∈ L2 if the phase of the Fourier transform x̂ and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is p...
متن کامل